integer polynomial造句

例句与造句

1. These are the only possible integer polynomial factors of f ( x ).
2. Every irreducible integer polynomial of degree n, is isomorphic to a full-rank lattice in \ mathbb { Z } ^ n.
3. Elements of R ( i . e ., residues modulo f ( x ) ) are typically represented by integer polynomials of degree less than n.
4. possible combinations, of which half can be discarded as the negatives of the other half, corresponding to 64 possible second degree integer polynomials that must be checked.
5. In the case of cubic fields, a cubic integer polynomial " P " irreducible over "'Q "'will have at least one real root.
6. It's difficult to find integer polynomial in a sentence. 用integer polynomial造句挺难的
7. The ring of integer valued polynomials with rational number coefficients is a Pr黤er domain, although the ring "'Z "'[ " X " ] of integer polynomials is not,.
8. It will also be irreducible over the integers, unless all its coefficients have a nontrivial factor in common ( in which case as integer polynomial will have some prime number, necessarily distinct from, as an irreducible factor ).
9. :: : Are you trying to understand how to lift polynomial factorizations from Z / pZ to the p-adic integers, as in the algorithm to factor integer polynomials described in the original talk ) 14 : 41, 28 August 2009 ( UTC)
10. Since integer polynomials must factor into integer polynomial factors, and evaluating integer polynomials at integer values must produce integers, the integer values of a polynomial can be factored in only a finite number of ways, and produce only a finite number of possible polynomial factors.
11. Since integer polynomials must factor into integer polynomial factors, and evaluating integer polynomials at integer values must produce integers, the integer values of a polynomial can be factored in only a finite number of ways, and produce only a finite number of possible polynomial factors.
12. Since integer polynomials must factor into integer polynomial factors, and evaluating integer polynomials at integer values must produce integers, the integer values of a polynomial can be factored in only a finite number of ways, and produce only a finite number of possible polynomial factors.
13. Because polynomials with integer coefficients, and integers themselves, are directly expressible in the language of arithmetic, if a multivariate integer polynomial equation " p " = 0 does have a solution in the integers then any sufficiently strong system of arithmetic " T " will prove this.
14. Let q \ equiv 1 \ bmod 2n be a sufficiently large public prime modulus ( bounded by a polynomial in n ), and let R _ q = R / \ langle q \ rangle = \ mathbb { Z } _ q [ x ] / \ langle f ( x ) \ rangle be the ring of integer polynomials modulo both f ( x ) and q.
15. Turning to the case of general objective functions " f ", if the variables are unbounded then the problem may in fact be uncomputable : it follows from the solution of Hilbert's 10th problem ( see ), that there exists no algorithm which, given an integer polynomial " f " of degree 8 in 58 variables, decides if the minimum value of f over all 58-dimensional integer vectors is 0.